Shortest path poset of Bruhat intervals

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shortest path poset of Bruhat intervals

Let [u, v] be a Bruhat interval and B(u, v) be its corresponding Bruhat graph. The combinatorial and topological structure of the longest u-v paths of B(u, v) has been extensively studied and is well-known. Nevertheless, not much is known of the remaining paths. Here we describe combinatorial properties of the shortest u-v paths of B(u, v). We also derive the non-negativity of some coefficients...

متن کامل

Shortest path poset of finite Coxeter groups

We define a poset using the shortest paths in the Bruhat graph of a finite Coxeter group W from the identity to the longest word in W , w0. We show that this poset is the union of Boolean posets of rank absolute length of w0; that is, any shortest path labeled by reflections t1, . . . , tm is fully commutative. This allows us to give a combinatorial interpretation to the lowest-degree terms in ...

متن کامل

On a Bruhat-like Poset

We investigate the combinatorics and the topology of the poset of strata of a Schubert like stratification on the Grassmannian of hermitian lagrangian spaces in Cn ⊕ Cn. We prove that this poset is a modular complemented lattice, we compute its Möbius function and we investigate the combinatorics and the topology of its order intervals.

متن کامل

Bruhat Intervals and Polyhedral Cones

Lecture notes by Matthew Dyer for lectures at the workshop “Coxeter groups and convex geometry.” 1. Root labelled Bruhat graph 1.1. Bruhat order. Let (W,S) be a Coxeter group. Bruhat order is the partial order defined by the following proposition; see [3] and [13] for more details. Proposition. There is a partial order ≤ on W with the following properties. Let w ∈ W and w = s1 . . . sn, n = l0(...

متن کامل

Inversion arrangements and Bruhat intervals

Let W be a finite Coxeter group. For a given w ∈ W , the following assertion may or may not be satisfied: (∗) The principal Bruhat order ideal of w contains as many elements as there are regions in the inversion hyperplane arrangement of w. We present a type independent combinatorial criterion which characterises the elements w ∈ W that satisfy (∗). A couple of immediate consequences are derive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2012

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-012-0416-7